Search results for "Birthday problem"
showing 1 items of 1 documents
Kasiski's Test: Couldn't the Repetitions be by Accident?
2006
Abstract In searching for repetitions in a periodic polyalphabetic ciphertext, we usually find several true (causal) repetitions that give information about the period. But we also find some accidental repetitions at distances unrelated to the period which may mislead the cryptanalyst. A simple formula shows that these accidents are rather unlikely.